Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K
نویسنده
چکیده
ABSTRACT We consider systems Al(t)y(q t)+ . . . +A0(t)y(t) = b(t) of higher order q-recurrence equations with rational coecients. We extend a method for nding a bound on the maximal power of t in the denominator of arbitrary rational solutionsy(t) aswell as amethod for bounding the degree of polynomial solutions from the scalar case to the systems case. e approach is direct and does not rely on uncoupling or reduction to a rst order system. Unlike in the scalar case this usually requires an initial transformation of the system.
منابع مشابه
Denominator Bounds for Systems of Recurrence Equations using $\Pi\Sigma$-Extensions
We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, q-hypergeometric products or their mixed versions. These linear systems are formulated in the setting of ΠΣ -extensions and our goal is to find a denominator bound (also known as universal denominator) for ...
متن کاملSome inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm
Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملCoupled systems of equations with entire and polynomial functions
We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1} A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We derive a priory estimates for the sums of the rootsof the considered system andfor the counting function of roots.
متن کاملMultibasic and Mixed Gosper's Algorithm
Gosper s summation algorithm nds a hypergeometric closed form of an inde nite sum of hyperge ometric terms if such a closed form exists We generalize his algorithm to the case when the terms are simultaneously hypergeometric and multibasic q hypergeometric We also provide algorithms for computing hypergeometric canonical forms of rational functions and for nding polynomial solutions of recurren...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017